A Highly Parameterised and Efficient FPGA-Based Skeleton for Pairwise Biological Sequence Alignment
نویسندگان
چکیده
This paper presents the design and implementation of the most parameterisable FPGA-based skeleton for pairwise biological sequence alignment reported in the literature. The skeleton is parameterised in terms of the sequence symbol type i.e. DNA, RNA, or Protein sequences, the sequence lengths, the match score i.e. the score attributed to a symbol match, mismatch or gap, and the matching task i.e. the algorithm used to match sequences, which includes global alignment, local alignment and overlapped matching. Instances of the skeleton implement the Smith-Waterman and the Needleman-Wunsch algorithms. The skeleton has the advantage of being captured in the Handel-C language, which makes it FPGA platformindependent. Hence, the same code could be ported across a variety of FPGA families. It implements the sequence alignment algorithm in hand using a pipeline of basic processing elements, which are tailored to the algorithm parameters. The paper presents a number of optimisations built into the skeleton and applied at compile-time depending on the user-supplied parameters. These result in high performance FPGA implementations tailored to the algorithm in hand. For instance, actual hardware implementations of the Smith-Waterman algorithm for Protein sequence alignment achieve speed-ups of two orders of magnitude compared to equivalent standard desktop software implementations.
منابع مشابه
gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملAn Efficient Core Architecture for Protein Sequence Alignment
This paper presents efficient biological sequence alignment core architecture to reduce execution time of the wellknown dynamic programming-based (DP) pairwise sequence alignment algorithms i.e. the Smith Waterman algorithm. The PE was prototyped in the Xilinx Virtex 5 FPGA with further improvements have been done in the scheduling strategy of alignment matrix computation and substitution coeff...
متن کاملHigh Performance Biological Pairwise Sequence Alignment: FPGA versus GPU versus Cell BE versus GPP
متن کامل
FPGA architecture for pairwise statistical significance estimation
Sequence comparison is one of the most fundamental computational problems in bioinformatics. Pairwise sequence alignment methods align two sequences using a substitution matrix consisting of pairwise scores of aligning different residues with each other (like BLOSUM62), and give an alignment score for the given sequence-pair. This work 1 addresses the problem of accurately estimating statistica...
متن کاملDesign and Implementation of an FPGA-based Core for Gapped BLAST Sequence Alignment with the Two-Hit Method
-This paper presents the design and implementation of the first FPGA-based core for Gapped BLAST sequence alignment with the two-hit method, ever reported in the literature. Gapped BLAST with two hit is a heuristic biological sequence alignment algorithm which is very widely used in the Bioinformatics and Computational Biology world. The architecture of the core is parameterized in terms of seq...
متن کامل